Planar Curve Representation and Matching

نویسندگان

  • Maher Al-Khaiyat
  • Farhad Kamangar
چکیده

In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two sets of angles. The angles are defined by vectors constructed from the center point of the circles and the points on the curve trace that intersect each circle. The circles have incrementally increasing radii represented by the minimum radius and the radius increment value. The number of circles used specifies the level of abstraction at which the curves are represented. This representation is invariant to translation and rotation transformations. Experiments with different classes of curves have shown that our technique is robust to digitization errors and noise effects, and can perform well when the number of concentric circles are relatively small. In particular, we describe the potential applicability of this technique to fingerprint identification problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division

In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...

متن کامل

Construction of a surface pencil with a common special surface curve

In this study, we introduce a new type of surface curves called $D$-type curve. This curve is defined by the property that the unit Darboux vector $vec{W}_{0} $ of a surface curve $vec{r}(s)$ and unit surface normal $vec{n} $ along the curve $vec{r}(s)$ satisfy the condition $leftlangle vec{n} ,vec{W}_{0} rightrangle =text{constant}$. We point out that a $D$-type curve is a geodesic curve or an...

متن کامل

2 Untangling Planar Curves

6 Any generic closed curve in the plane can be transformed into a simple closed curve by a finite 7 sequence of local transformations called homotopy moves. We prove that simplifying a planar 8 closed curve with n self-crossings requires Θ(n3/2) homotopy moves in the worst case. Our 9 algorithm improves the best previous upper bound O(n2), which is already implicit in the classical 10 work of S...

متن کامل

A faster algorithm for matching planar maps under the weak Fréchet distance

We consider the problem of matching a polygonal curve of complexity p with an arbitrary curve on an embedded planar graph of complexity q. With the large amount of GPS and location trace data that have become available in recent years, algorithms for such problems have become increasingly important. Direct applications include matching a GPS trace to a given roadmap and indirect applications in...

متن کامل

Analytical Matching of Optimal Damping Characteristics Curve for Vehicle Passive Suspensions

To facilitate the damping matching of dampers for vehicle passive suspensions, this paper proposes an analytical matching method of the optimal piecewise linear damping characteristics curve. Based on the vehicle vibration model, taking the suspension dynamic deflection as the constraint, by the vibration acceleration and the wheel dynamic load, an objective function about the relative damping ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998